Approximating mixed Hölder functions using random samples
نویسندگان
چکیده
منابع مشابه
Reconstructing Functions from Random Samples
From a sufficiently large point sample lying on a compact Riemannian submanifold of Euclidean space, one can construct a simplicial complex which is homotopy-equivalent to that manifold with high confidence. We describe a corresponding result for a Lipschitz-continuous function between two such manifolds. That is, we outline the construction of a simplicial map which recovers the induced maps o...
متن کاملImpossibility of Approximating Analytic Functions from Equispaced Samples
It is shown that no stable procedure for approximating functions from equally spaced samples can converge geometrically for analytic functions. The proof combines a Bernstein inequality of 1912 with an estimate due to Coppersmith and Rivlin in 1992. In a nutshell, you can't beat Gibbs and Runge. Monday December 14 2009 4:30 PM Building 4, Room 370 Refreshments are available in Building 2, Room ...
متن کاملApproximating separable nonlinear functions via mixed zero-one programs
We discuss two models from the literature that have been developed to formulate piecewise linear approximations of separable nonlinear functions by way of mixed-integer programs. We show that the most commonly proposed method is computationally inferior to a lesser known technique by comparing analytically the linear programming relaxations of the two formulations. A third way of formulating th...
متن کاملApproximating Higher-Order Distances Using Random Projections
We provide a simple method and relevant theoretical analysis for efficiently estimating higherorder lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6, 8, 10..., (i.e., when p is even). Distance-based methods are popular in machine learning. In large-scale applications, storing, computing, and retrieving the distances can be both space and time pro...
متن کاملRandom Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilistic polynomial-time veri er V and a debate between Player 1, who claims that the input x is in L, and Player 0, who claims that the input x is not in L. It is known that there is a PCDS for L in which V ips O(logn) coins and reads O(1) bits of the debate if and only if L is in PSPACE ([Condon et al., Pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2019
ISSN: 1050-5164
DOI: 10.1214/19-aap1471